On identifying codes that are robust against edge changes

On Identifying Codes in the King Grid that are Robust Against Edge Deletions

Assume that G = (V,E) is an undirected graph, and C ⊆ V . For every v ∈ V , we denote Ir(G; v) = {u ∈ C : d(u, v) ≤ r}, where d(u, v) denotes the number of edges on any shortest path from u to v. If all the sets Ir(G; v) for v ∈ V are pairwise different, and none of them is the empty set, the code C is called r-identifying. If C is r-identifying in all graphs G that can be obtained from G by de...

Tolerant identification with Euclidean balls

The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. The identifying codes can be applied, for example, to sensor networks. In this paper, we consider as sensors the set Z 2 where one sensor can check its neighbours within Euclidean distance r. We construct tolerant identifying codes in this network that are robust against some changes in the neighbourh...

On 2-edge robust r-identifying codes in the king grid

Design and Test of New Robust QCA Sequential Circuits

   One of the several promising new technologies for computing at nano-scale is quantum-dot cellular automata (QCA). In this paper, new designs for different QCA sequential circuits are presented. Using an efficient QCA D flip-flop (DFF) architecture, a 5-bit counter, a novel single edge generator (SEG) and a divide-by-2 counter are implemented. Also, some types of oscillators, a new edge-t...

Compressed Image Hashing using Minimum Magnitude CSLBP

Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...